Quantifier rules in reductive proof using nominal semantics
نویسندگان
چکیده
Reductive proof-search tries to reduce a goal to tautologies. In the presence of quantifiers this becomes a complex design problem by which proof-theory shades into ‘proof-engineering’. There is no single right answer here, but there are a lot of practical problems with strong roots in theory. In this work we consider a nominal semantics for this design space. The reduction in complexity is striking, and we get an elementary account of reductive proof-search with quantifiers.
منابع مشابه
A Nominal Approach of Fusion Calculus
We provide a nominal semantics of the monadic version of the fusion calculus. A set of compact transition rules is presented in the FraenkelMostowski framework by using a specific nominal quantifier. Using several nominal techniques, it is proved the equivalence between the new nominal semantics and the original semantics of the monadic fusion calculus.
متن کاملModelling Generic Judgements
We propose a semantics for the ∇-quantifier of Miller and Tiu. First we consider the case for classical first-order logic. In this case, the interpretation is close to standard Tarski-semantics and completeness can be shown using a standard argument. Then we put our semantics into a broader context by giving a general interpretation of ∇ in categories with binding structure. Since categories wi...
متن کاملCategorematic unreducible polyadic quantifiers in Lexical Resource Semantics
Early work on quantification in natural languages showed that sentences like Every ape picked different berries, on the reading that the sets of berries picked by any two apes are not the same, can be logically represented with a single polyadic quantifier for the two nominal phrases. However, since that quantifier cannot be decomposed into two quantifiers for the two nominal phrases, a composi...
متن کاملSeparable Sequent Calculus for First-order Classical Logic (Work in Progress)
This paper presents Separable Sequent Calculus as an extension of Gentzen’s first-order classical sequent calculus with Herband-style structural rules (subformula contraction and weakening). Every proof can be transformed into separated form, in which all logical rules precede all structural rules, a result in the spirit of Gentzen’s midsequent theorem or sharpened Hauptsatz (where all proposit...
متن کاملA Simpler Proof Theory for Nominal Logic
Nominal logic is a variant of first-order logic which provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012